Generalized Leibniz functional matrices and factorizations of some well-known matrices
نویسندگان
چکیده
منابع مشابه
GENERALIZED REGULAR FUZZY MATRICES
In this paper, the concept of k-regular fuzzy matrix as a general- ization of regular matrix is introduced and some basic properties of a k-regular fuzzy matrix are derived. This leads to the characterization of a matrix for which the regularity index and the index are identical. Further the relation between regular, k-regular and regularity of powers of fuzzy matrices are dis- cussed.
متن کاملVery cleanness of generalized matrices
An element $a$ in a ring $R$ is very clean in case there exists an idempotent $ein R$ such that $ae = ea$ and either $a- e$ or $a + e$ is invertible. An element $a$ in a ring $R$ is very $J$-clean provided that there exists an idempotent $ein R$ such that $ae = ea$ and either $a-ein J(R)$ or $a + ein J(R)$. Let $R$ be a local ring, and let $sin C(R)$. We prove that $Ain K_...
متن کاملGeneralized Schur Methods to Compute Coprime Factorizations of Rational Matrices
Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices factorizations with least order denominators factorizations with inner denominators and factorizations with proper stable factors The new algorithms are based on a recursive generalized Schur algorithm for pole assignment They are generally applicable regardles...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملCustomizable triangular factorizations of matrices
Customizable triangular factorizations of matrices find their applications in computer graphics and lossless transform coding. In this paper, we prove that any N ×N nonsingular matrix A can be factorized into 3 triangular matrices, A = PLUS, where P is a permutation matrix, L is a unit lower triangular matrix, U is an upper triangular matrix of which the diagonal entries are customizable and ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2009
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.08.014